The influence lower bound via query elimination
نویسندگان
چکیده
We give a simple proof, via query elimination, of a result due to O’Donnell, Saks, Schramm, and Servedio, which shows a lower bound on the zero-error expected query complexity of a function f in terms of the maximum influence of any variable of f . Our lower bound also applies to the two-sided error expected query complexity of f , and it allows an immediate extension which can be used to prove stronger lower bounds for some functions. ACM Classification: F.1.3 AMS Classification: 68Q17
منابع مشابه
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What is the predecessor of x in S?” can be answered efficiently. We study this problem in the cell probe model introduced by Yao [Yao81]. Recently, Beame and Fich [BF99] obtained optimal bounds on the number of probes needed b...
متن کامل. C C / 0 30 90 33 v 1 1 7 Se p 20 03 Lower bounds for predecessor searching in the cell probe model ∗
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What is the predecessor of x in S?” can be answered efficiently. We study this problem in the cell probe model introduced by Yao [Yao81]. Recently, Beame and Fich [BF99] obtained optimal bounds on the number of probes needed b...
متن کاملA Quadratically Tight Partition Bound for Classical Communication and Query Complexity
The partition bound introduced in [4] is a way to prove lower bounds in classical communication and query complexity. While the partition bound provides a strong and general way to prove lower bounds, it remains open how tight the bounds obtained from this method are. In this work we give quadratically tight lower bounds via a strengthened version of the partition bound, which we call the publi...
متن کاملThe Polynomial Method Strikes Back: Tight Quantum Query Bounds via Dual Polynomials
The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. The approximate degree of f is known to be a lower bound on the quantum query complexity of f (Beals et al., FOCS 1998 and J. ACM 2001). We resolve or nearly resolve the approximate degree and quantum query complexities of several basic functions. Specifica...
متن کاملLower Bounds for OBDD-Based Proofs of Unsatisfiability and Symbolic Quantifier Elimination Algorithms∗
We demonstrate a family of propositional formulas in conjunctive normal form so that a formula of size N requires size 2 Ω(1) to refute using the tree-like OBDD refutation system of Atserias, Kolaitis and Vardi [3] with respect to all variable orderings. The lower bound generalizes earlier lower bounds on OBDD-based proofs of unsatisfiability in that it applies for all variable orderings, it ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theory of Computing
دوره 7 شماره
صفحات -
تاریخ انتشار 2011